Average case analysis of dynamic geometric optimization
نویسندگان
چکیده
منابع مشابه
Towards Average-Case Complexity Analysis of NP Optimization Problems
For the worst case complexity measure if P NP then P OptP i e all NP optimization problems are polynomial time solvable On the other hand it is not clear whether a similar relation holds when considering average case complexity We investigate the relationship between the complexity of NP decision problems and that of NP optimization problems under polynomial time computable distributions and st...
متن کاملSensitivity Analysis of Water Flooding Optimization by Dynamic Optimization
This study concerns the scope to improve water flooding in heterogeneous reservoirs. We used an existing, in-house developed, optimization program consisting of a reservoir simulator in combination with an adjoint-based optimal control algorithm. In particular we aimed to examine the scope for optimization in a two-dimensional horizontal reservoir containing a single high permeable streak, ...
متن کاملesp needs analysis of iranian ma students: a case study of university of isfahan
نیاز سنجی دانشجویان کارشناسی ارشد ایرانی در رابطه با زبان تخصصی: مطالعه ای در دانشگاه اصفهان هدف از این مطالعه بررسی نیازهای یادگیری زبان خارجی دانشجویان کارشناسی ارشد دانشجویان دانشگاه اصفهان در رشته های زیست شناسی، روانشناسی، تربیت بدنی، حسابداری و فلسفه ی غرب میباشد. در مجموع 80 دانشجودر پنج رشته ی متفاوت از دانشگاه اصفهان در این پژوهش شرکت داشتند.علاوه بر این هشتاد دانشجو،25 استاد دروس ت...
15 صفحه اولAverage Case Analysis of Dynamic Graph Algorithms 25
[32] V. V. Vazirani. A theory of alternating paths and blossoms for proving correctness of the O(p V E) general graph maximum matching algorithm. [13] G. N. Frederickson. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. Linear time algorithms for nding a sparse k-connected spanning subgraph of a k-connected graph. Re-randomization and average case analys...
متن کاملAverage Case Analysis of Fully Dynamic Reachability for Directed Graphs
We consider the problem of maintaining the transitive closure in a directed graph under edge insertions and deletions from the point of view of average case analysis. Say n the number of nodes and m the number of edges. We present a data structure that supports the report of a path between two nodes in O(nlog n) expected time and O(1) amortized time per update, and reachability queries in O(1) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1996
ISSN: 0925-7721
DOI: 10.1016/0925-7721(95)00018-6